Public Key Encryption Algorithm and the Random Oracle

نویسنده

  • Divya Kumar
چکیده

Cryptographic theory has provided a potentially invaluable notion for cryptographic practice: the idea of provable security. Unfortunately, theoretical work often gains provable security only at the cost of effciency. Schemes like standard RSA are efficient but not provably secured. There are schemes who are provably secured but are not efficient. However, there are encryption schemes, for eg. El Gamal encryption, which are efficient and secured at the same time. There is a need to construct more encryption schemes which are provably secure, but also efficient.One of the approach use is through Random Oracles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Secure Channel Free Public Key Encryption with Keyword Search Scheme without Random Oracle

The public key encryption with keyword Search (PEKS) scheme, proposed by Boneh, Di Crescenzo, Ostrovsky and Persiano, enables one to search for encrypted keywords without compromising the security of the original data. Baek et al. noticed that the original notion of PEKS requires the existence of a secure channel, and they further extended this notion by proposing an efficient secure channel fr...

متن کامل

PSEC: Provably Secure Elliptic Curve Encryption Scheme (Submission to P1363a)

We describe an elliptic curve encryption scheme, PSEC (provably secure elliptic curve encryption scheme), which has two versions: PSEC-1 and PSEC-2. PSEC-1 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function and a random function (hash function). PSEC-2 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function, two random funct...

متن کامل

Decryptable Searchable Encryption

As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This paper introduces searchable encryption schemes which enable decryption. An additional feature is that the decryption key and the trapdoor derivation key are totally independent, thereby complying with many contexts of a...

متن کامل

CCA Secure Publicly Verifiable Public Key Encryption Without Pairings Nor Random Oracle and Its Applications

hosen ciphertext security (CCA security)hosen ciphertext security (CCA security)C is now a widely accepted necessary security notion for public key encryption. CCA secure public verifiable public key encryption has many applications such as threshold public key encryption and proxy re-encryption etc. Furthermore, these years “random oracle model” has seen risen criticize by many cryptographers....

متن کامل

Quantum security of the Fujisaki-Okamoto transform

In this paper, we present a hybrid encryption scheme that is chosen ciphertext secure in the quantum random oracle model. Our scheme is a combination of an asymmetric and a symmetric encryption scheme that are secure in a weak sense. It is a slight modi cation of Fujisaki and Okamoto's transformation that is secure against classical adversaries. keywords: Quantum, Random Oracle, Indistinguishab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009